On Bond Incident Degree Indices of Chemical Graphs
نویسندگان
چکیده
By swapping out atoms for vertices and bonds edges, a graph may be used to model any molecular structure. A G is considered chemical in theory if no vertex of has degree 5 or greater. The bond incident (BID) index defined as the total contributions f(dG(u),dG(v)) from all edges uv G, where dG(w) stands w E(G) set f real-valued symmetric function. This paper addresses problem finding graphs with extremum BID indices over class fixed number vertices.
منابع مشابه
On the extremal graphs with respect to bond incident degree indices
Many existing degree based topological indices can be clasified as bond incident degree (BID) indices, whose general form is BID(G) = ∑ uv∈E(G) Ψ(du, dv), where uv is the edge connecting the vertices u, v of the graph G, E(G) is the edge set of G, du is the degree of the vertex u and Ψ is a non-negative real valued (symmetric) function of du and dv. Here, it has been proven that if the extensio...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملOn discriminativity of vertex-degree-based indices
A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...
متن کاملOn multiplicative Zagreb indices of graphs
Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) 1 G and ( ) 2 G , under the name first and second multiplicative Zagreb index, respectively. These are define as ( ) 2 1 ( ) ( ) v V G G G d v and ( ) ( ) ( ) ( ) 2...
متن کاملOn diameter and inverse degree of chemical graphs
The inverse degree r(G) of a finite graph G = (V,E) is defined as r(G) = ∑ v∈V 1 d(v) , where d(v) is the degree of vertex v. In Discrete Math. 310 (2010), 940-946, Mukwembi posed the following conjecture: Let G be a connected chemical graph with diameter diam(G) and inverse degree r(G). Then diam(G) ≤ 12 5 r(G) +O(1). In this paper, we settle the conjecture affirmatively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11010027